An exponent one-fifth algorithm for deterministic integer factorisation

Hittmeir recently presented a deterministic algorithm that provably computes the prime factorisation of positive integer $N$ in $N^{2/9+o(1)}$ bit operations. Prior to this breakthrough, best known complexity bound for problem was $N^{1/4+o(1)}$, result going back 1970s. In paper we push Hittmeir's techniques further, obtaining rigorous, factoring with $N^{1/5+o(1)}$.